On Integers Expressible by Some Special Linear Form
نویسنده
چکیده
Let E(4) be the set of positive integers expressible by the form 4M −d, where M is a multiple of the product ab and d is a divisor of the sum a + b of two positive integers a, b. We show that the set E(4) does not contain perfect squares and three exceptional positive integers 288, 336, 4545 and verify that E(4) contains all other positive integers up to 2 · 109. We conjecture that there are no other exceptional integers. This would imply the Erdős-Straus conjecture asserting that each number of the form 4/n, where n ≥ 2 is a positive integer, is the sum of three unit fractions 1/x+1/y+1/z. We also discuss similar problems for sets E(t), where t ≥ 3, consisting of positive integers expressible by the form tM − d. The set E(5) is related to a conjecture of Sierpiński, whereas the set E(t), where t is any integer greater than or equal to 4, is related to the most general in this context conjecture of Schinzel.
منابع مشابه
ALTERNATING EULER SUMS AND SPECIAL VALUES OF WITTEN MULTIPLE ZETA FUNCTION ATTACHED TO so(5)
Abstract. In this note we shall study the Witten multiple zeta function associated to the Lie algebra so(5) defined by Matsumoto. Our main result shows that its special values at nonnegative integers are always expressible by alternating Euler sums. More precisely, every such special value of weight w ≥ 3 is a finite rational linear combination of alternating Euler sums of weight w and depth at...
متن کاملOn the Frobenius Problem for Geometric Sequences
Let a, b, k be positive integers, with gcd(a, b) = 1, and let A denote the geometric sequence a, ak−1b, . . . , abk−1, b. Let Γ(A) denote the set of integers that are expressible as a linear combination of elements of A with non-negative integer coefficients. We determine g(A) and n(A) which denote the largest (respectively, the number of) positive integer(s) not in Γ(A). We also determine the ...
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملExtension of primal-dual interior point methods to diff-convex problems on symmetric cones
We consider the extension of primal dual interior point methods for linear programming on symmetric cones, to a wider class of problems that includes approximate necessary optimality conditions for functions expressible as the difference of two convex functions of a special form. Our analysis applies the Jordan-algebraic approach to symmetric cones. As the basic method is local, we apply the id...
متن کامل# a 44 Integers 10 ( 2010 ) , 523 - 529 on the Frobenius Problem
For positive integers a, k, let Ak(a) denote the sequence ak, ak + 1, ak + a, . . . , ak + ak−1. Let Γ ( Ak(a) ) denote the set of integers that are expressible as a linear combination of elements of Ak(a) with non-negative integer coefficients. We determine g ( Ak(a) ) and n ( Ak(a) ) which denote the largest (respectively, the number of) positive integer(s) not in Γ ( Ak(a) ) . We also determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012